A Generalization of the Ramanujan Polynomials and Plane Trees

نویسندگان

  • Victor J. W. Guo
  • Jiang Zeng
چکیده

Generalizing a sequence of Lambert, Cayley and Ramanujan, Chapoton has recently introduced a polynomial sequence Qn := Qn(x, y, z, t) defined by Q1 = 1, Qn+1 = [x+ nz + (y + t)(n + y∂y)]Qn. In this paper we prove Chapoton’s conjecture on the duality formula: Qn(x, y, z, t) = Qn(x+nz+ nt, y,−t,−z), and answer his question about the combinatorial interpretation of Qn. Actually we give combinatorial interpretations of these polynomials in terms of plane trees, half-mobile trees, and forests of plane trees. Our approach also leads to a general formula that unifies several known results for enumerating trees and plane trees.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A generalization of Kawanaka’s identity for Hall-Littlewood polynomials and applications

Recently, starting from two infinite summation formulae for Hall-Littlewood polynomials, two of the present authors [7] have generalized a method due to Macdonald [9] to obtain new finite summation formulae for these polynomials. This approach permits them to extend Stembridge’s list of multiple qseries identities of Rogers-Ramanujan type [12]. Conversely these symmetric functions identities ca...

متن کامل

A new generalization of Cayley’s formula for trees

Generalizing a sequence of Lambert, Cayley and Ramanujan, Chapoton introduced the following polynonmial sequence: Q1 = 1, Qn+1 = [u+ nz + (y + t)(n+ y∂y)]Qn. In response to two questions of Chapton, we give several combinatorial interpretations of Qn in terms of plane trees, half-mobile trees, and forests of plane trees and prove a duality of Qn. We also derive an enumeration formula that unifi...

متن کامل

Bijections behind the Ramanujan Polynomials

The Ramanujan polynomials were introduced by Ramanujan in his study of power series inversions. In an approach to the Cayley formula on the number of trees, Shor discovers a refined recurrence relation in terms of the number of improper edges, without realizing the connection to the Ramanujan polynomials. On the other hand, Dumont and Ramamonjisoa independently take the grammatical approach to ...

متن کامل

ar X iv : m at h / 01 07 02 4 v 1 [ m at h . C O ] 4 J ul 2 00 1 Bijections behind the Ramanujan Polynomials

The Ramanujan polynomials were introduced by Ramanujan in his study of power series inversions. These polynomials have been closely related to the enumeration of trees. In an approach to the Cayley formula on the number of trees, Shor discovers a refined recurrence relation in terms of the number of improper edges, without realizing the connection to the Ramanujan polynomials. On the other hand...

متن کامل

Basis partition polynomials, overpartitions and the Rogers-Ramanujan identities

In this paper, a common generalization of the Rogers-Ramanujan series and the generating function for basis partitions is studied. This leads naturally to a sequence of polynomials, called BsP-polynomials. In turn, the BsP-polynomials provide simultaneously a proof of the Rogers-Ramanujan identities and a new, more rapidly converging series expansion for the basis partition generating function....

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006